Serveur d'exploration sur la musique en Sarre

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Ω mega : Computer Supported Mathematics

Identifieur interne : 000A52 ( Main/Exploration ); précédent : 000A51; suivant : 000A53

Ω mega : Computer Supported Mathematics

Auteurs : Jörg Siekmann [Allemagne] ; Christoph Benzmüller [Allemagne]

Source :

RBID : ISTEX:04B50FC1400694764881604FABEFD5904695B73B

English descriptors

Abstract

Abstract: The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated deduction used machine oriented calculi to find the proof for a theorem by automatic means, the Automath project of N.G. de Bruijn – more modest in its aims with respect to automation – showed in the late 1960s and early 70s that a complete mathematical textbook could be coded and proof-checked by a computer. Classical theorem proving procedures of today are based on ingenious search techniques to find a proof for a given theorem in very large search spaces – often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to more abstract planning techniques however opened up a new paradigm for mathematical reasoning on a computer and several systems of the new kind now employ a mix of interactive, search based as well as proof planning techniques. The Ωmega system is at the core of several related and well-integrated research projects of the Ωmega research group, whose aim is to develop system support for the working mathematician, in particular it supports proof development at a human oriented level of abstraction. It is a modular system with a central proof data structure and several supplementary subsystems including automated deduction and computer algebra systems. Ωmega has many characteristics in common with systems like NuPrL [ACE + 00], CoQ [Coq03], Hol [GM93], Pvs [ORR + 96], and Isabelle [Pau94,NPW02]. However, it differs from these systems with respect to its focus on proof planning and in that respect it is more similar to the proof planning systems Clam and λClam at Edinburgh [RSG98,BvHHS90].

Url:
DOI: 10.1007/978-3-540-30221-6_2


Affiliations:


Links toward previous steps (curation, corpus...)


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct:series">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Ω mega : Computer Supported Mathematics</title>
<author>
<name sortKey="Siekmann, Jorg" sort="Siekmann, Jorg" uniqKey="Siekmann J" first="Jörg" last="Siekmann">Jörg Siekmann</name>
</author>
<author>
<name sortKey="Benzmuller, Christoph" sort="Benzmuller, Christoph" uniqKey="Benzmuller C" first="Christoph" last="Benzmüller">Christoph Benzmüller</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:04B50FC1400694764881604FABEFD5904695B73B</idno>
<date when="2004" year="2004">2004</date>
<idno type="doi">10.1007/978-3-540-30221-6_2</idno>
<idno type="url">https://api.istex.fr/document/04B50FC1400694764881604FABEFD5904695B73B/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000049</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000049</idno>
<idno type="wicri:Area/Istex/Curation">000048</idno>
<idno type="wicri:Area/Istex/Checkpoint">000847</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000847</idno>
<idno type="wicri:doubleKey">0302-9743:2004:Siekmann J:mega:computer:supported</idno>
<idno type="wicri:Area/Main/Merge">000A52</idno>
<idno type="wicri:Area/Main/Curation">000A52</idno>
<idno type="wicri:Area/Main/Exploration">000A52</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Ω mega : Computer Supported Mathematics</title>
<author>
<name sortKey="Siekmann, Jorg" sort="Siekmann, Jorg" uniqKey="Siekmann J" first="Jörg" last="Siekmann">Jörg Siekmann</name>
<affiliation wicri:level="3">
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Saarland University, Saarbrücken</wicri:regionArea>
<placeName>
<region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author>
<name sortKey="Benzmuller, Christoph" sort="Benzmuller, Christoph" uniqKey="Benzmuller C" first="Christoph" last="Benzmüller">Christoph Benzmüller</name>
<affiliation wicri:level="3">
<country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Saarland University, Saarbrücken</wicri:regionArea>
<placeName>
<region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2004</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="Teeft" xml:lang="en">
<term>Abstract level</term>
<term>Acyclic graph</term>
<term>Algebra</term>
<term>Ants agents</term>
<term>Applicable theorems</term>
<term>Appropriate methods</term>
<term>Arithmetic computation</term>
<term>Assertion level</term>
<term>Blackboard architecture</term>
<term>Bundy</term>
<term>Calculus</term>
<term>Case studies</term>
<term>Case study</term>
<term>Challenge problems</term>
<term>Christoph</term>
<term>Complete formalization</term>
<term>Complete proof plan</term>
<term>Computational</term>
<term>Computational logic</term>
<term>Computer</term>
<term>Computer algebra</term>
<term>Computer algebra systems</term>
<term>Computer science</term>
<term>Constraint</term>
<term>Constraint solver</term>
<term>Constraint solvers</term>
<term>Control knowledge</term>
<term>Control rules</term>
<term>Current goal state</term>
<term>Current proof state</term>
<term>Current world state</term>
<term>Deduction systems</term>
<term>Development graph manager</term>
<term>Domain knowledge</term>
<term>Doris system</term>
<term>Early history</term>
<term>European conference</term>
<term>External systems</term>
<term>Goal state</term>
<term>Graphical user interface</term>
<term>Hierarchical</term>
<term>Higher level</term>
<term>Higher order</term>
<term>Information sources</term>
<term>Initial state</term>
<term>Interactive</term>
<term>Interesting case study</term>
<term>Interface</term>
<term>International conference</term>
<term>Kirchner</term>
<term>Knowledge base</term>
<term>Knowledge representation</term>
<term>Kohlhase</term>
<term>Limit theorems</term>
<term>Lnai</term>
<term>Lncs</term>
<term>Logical calculus</term>
<term>Lower level</term>
<term>Lowest level</term>
<term>Martin davis</term>
<term>Mathematical</term>
<term>Mathematical documents</term>
<term>Mathematical domain</term>
<term>Mathematical knowledge</term>
<term>Mathematical knowledge base</term>
<term>Mathematical knowledge bases</term>
<term>Mathematical knowledge management</term>
<term>Mathematical problem</term>
<term>Mathematical proof assistant</term>
<term>Mathematical publications</term>
<term>Mathematical reasoning</term>
<term>Mathematical research</term>
<term>Mathematical services</term>
<term>Mathematical software</term>
<term>Mathematical theorem</term>
<term>Mathematical theories</term>
<term>Mathematician</term>
<term>Mega</term>
<term>Mega project</term>
<term>Mega system</term>
<term>Meier</term>
<term>Melis</term>
<term>Michael kohlhase</term>
<term>Morgan kaufmann</term>
<term>Multi</term>
<term>Multiple strategies</term>
<term>Natural language</term>
<term>Node</term>
<term>Open node</term>
<term>Open nodes</term>
<term>Order atps</term>
<term>Pages brighton</term>
<term>Pages springer</term>
<term>Partial functions</term>
<term>Planner</term>
<term>Planning problem</term>
<term>Planning techniques</term>
<term>Proof</term>
<term>Proof assumptions</term>
<term>Proof checker</term>
<term>Proof construction</term>
<term>Proof context</term>
<term>Proof development</term>
<term>Proof explanation</term>
<term>Proof idea</term>
<term>Proof nodes</term>
<term>Proof object</term>
<term>Proof objects</term>
<term>Proof plan</term>
<term>Proof plan data structure</term>
<term>Proof planner multi</term>
<term>Proof planning</term>
<term>Proof planning process</term>
<term>Proof plans</term>
<term>Proof representation</term>
<term>Proof search</term>
<term>Proof steps</term>
<term>Proof tree</term>
<term>Prover</term>
<term>Real analysis</term>
<term>Reasoning procedures</term>
<term>Reasoning systems</term>
<term>Residue classes</term>
<term>Resolution principle</term>
<term>Retrieval</term>
<term>Saarland</term>
<term>Saarland university</term>
<term>Search engines</term>
<term>Semantic mediators</term>
<term>Several systems</term>
<term>Siekmann</term>
<term>Software</term>
<term>Software engineering</term>
<term>Sorge</term>
<term>Special issue</term>
<term>Springer</term>
<term>Subgoal</term>
<term>Symbolic computation</term>
<term>Symbolic reasoning</term>
<term>System description</term>
<term>System support</term>
<term>Tactical theorem</term>
<term>Technical report</term>
<term>Theorem</term>
<term>Theorem prover</term>
<term>Theorem provers</term>
<term>Type theory</term>
<term>User</term>
<term>Woody bledsoe</term>
</keywords>
</textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: The year 2004 marks the fiftieth birthday of the first computer generated proof of a mathematical theorem: “the sum of two even numbers is again an even number” (with Martin Davis’ implementation of Presburger Arithmetic in 1954). While Martin Davis and later the research community of automated deduction used machine oriented calculi to find the proof for a theorem by automatic means, the Automath project of N.G. de Bruijn – more modest in its aims with respect to automation – showed in the late 1960s and early 70s that a complete mathematical textbook could be coded and proof-checked by a computer. Classical theorem proving procedures of today are based on ingenious search techniques to find a proof for a given theorem in very large search spaces – often in the range of several billion clauses. But in spite of many successful attempts to prove even open mathematical problems automatically, their use in everyday mathematical practice is still limited. The shift from search based methods to more abstract planning techniques however opened up a new paradigm for mathematical reasoning on a computer and several systems of the new kind now employ a mix of interactive, search based as well as proof planning techniques. The Ωmega system is at the core of several related and well-integrated research projects of the Ωmega research group, whose aim is to develop system support for the working mathematician, in particular it supports proof development at a human oriented level of abstraction. It is a modular system with a central proof data structure and several supplementary subsystems including automated deduction and computer algebra systems. Ωmega has many characteristics in common with systems like NuPrL [ACE + 00], CoQ [Coq03], Hol [GM93], Pvs [ORR + 96], and Isabelle [Pau94,NPW02]. However, it differs from these systems with respect to its focus on proof planning and in that respect it is more similar to the proof planning systems Clam and λClam at Edinburgh [RSG98,BvHHS90].</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Allemagne</li>
</country>
<region>
<li>Sarre (Land)</li>
</region>
<settlement>
<li>Sarrebruck</li>
</settlement>
</list>
<tree>
<country name="Allemagne">
<region name="Sarre (Land)">
<name sortKey="Siekmann, Jorg" sort="Siekmann, Jorg" uniqKey="Siekmann J" first="Jörg" last="Siekmann">Jörg Siekmann</name>
</region>
<name sortKey="Benzmuller, Christoph" sort="Benzmuller, Christoph" uniqKey="Benzmuller C" first="Christoph" last="Benzmüller">Christoph Benzmüller</name>
<name sortKey="Benzmuller, Christoph" sort="Benzmuller, Christoph" uniqKey="Benzmuller C" first="Christoph" last="Benzmüller">Christoph Benzmüller</name>
<name sortKey="Siekmann, Jorg" sort="Siekmann, Jorg" uniqKey="Siekmann J" first="Jörg" last="Siekmann">Jörg Siekmann</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A52 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000A52 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Sarre
   |area=    MusicSarreV3
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:04B50FC1400694764881604FABEFD5904695B73B
   |texte=   Ω mega : Computer Supported Mathematics
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Sun Jul 15 18:16:09 2018. Site generation: Tue Mar 5 19:21:25 2024